Parallel Java Code Generation for Layer-unified Coarse Grain Task Parallel Processing
نویسندگان
چکیده
منابع مشابه
Cache Optimization for Coarse Grain Task Parallel Processing Using Inter-Array Padding
The wide use of multiprocessor system has been making automatic parallelizing compilers more important. To improve the performance of multiprocessor system more by compiler, multigrain parallelization is important. In multigrain parallelization, coarse grain task parallelism among loops and subroutines and near fine grain parallelism among statements are used in addition to the traditional loop...
متن کاملCoarse-Grain Task Parallel Processing Using the OpenMP Backend of the OSCAR Multigrain Parallelizing Compiler
This paper describes automatic coarse grain parallel processing on a shared memory multiprocessor system using a newly developed OpenMP backend of OSCAR multigrain parallelizing compiler for from single chip multiprocessor to a high performance multiprocessor and a heterogeneous supercomputer cluster. OSCAR multigrain parallelizing compiler exploits coarse grain task parallelism and near ne gra...
متن کاملCode generation techniques for the task-parallel programming language Spar
In this paper we describe a compilation scheme to translate implicitly parallel programs in the programming language Spar (an extension to Java) to efficient code for distributed-memory parallel computer systems. The compilation scheme is formulated as a set of transformation rules. In Spar, the language constructs for parallelization have been designed for comfortable use by the programmer, no...
متن کاملInterprocedural Transformations for Parallel Code Generation Interprocedural Transformations for Parallel Code Generation
We present a new approach that enables compiler optimization of procedure calls and loop nests containing procedure calls. We introduce two inter-procedural transformations that move loops across procedure boundaries, exposing them to traditional optimizations on loop nests. These transformations are incorporated into a code generation algorithm for a shared-memory multiprocessor. The code gene...
متن کاملCoarse Grain Parallel Finite Element Simulations for Incompressible Flows
Parallel simulation of incompressible fluid flows is considered on networks of homogeneous workstations. Coarse-grain parallelization of a Taylor–Galerkin/pressure–correction finite element algorithm are discussed, taking into account network communication costs. The main issues include the parallelization of system assembly, and iterative and direct solvers, that are of common interest to fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Online Transactions
سال: 2014
ISSN: 1882-6660
DOI: 10.2197/ipsjtrans.7.168